<html><head>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
<meta content="text/javascript" http-equiv="content-script-type">
<title>tango.util.container.RedBlack</title>

<link rel="stylesheet" type="text/css" href="css/style.css">
<!--[if lt IE 7]><link rel="stylesheet" type="text/css" href="css/ie56hack.css"><![endif]-->
<script language="JavaScript" src="js/util.js" type="text/javascript"></script>
<script language="JavaScript" src="js/tree.js" type="text/javascript"></script>
<script language="JavaScript" src="js/explorer.js" type="text/javascript"></script>
<script>
function anchorFromTitle(title, path, ext) {
  var url = path + title + "." + ext;
  document.write("<a href='" + url + "'>" + title + "</a>");
  }
</script>
</head><body>
<div id="tabarea"></div><div id="explorerclient"></div>
<div id="content"><script>explorer.initialize("tango.util.container.RedBlack");</script>
        <table class="content">
                <tr><td id="docbody"><h1><a href="http://www.dsource.org/projects/tango/browser/trunk/tango/util/container/RedBlack.d?rev=3791">tango.util.container.RedBlack</a></h1>
                
<b>License:</b><br>
BSD style: see <a href="http://www.dsource.org/projects/tango/wiki/LibraryLicense">license.txt</a><br><br>
<b>Version:</b><br>
Apr 2008: Initial release<br><br>
<b>Authors:</b><br>
Kris<br><br>
<b>Since:</b><br>0.99.7<br><br>        Based upon Doug Lea's Java collection package<br><br>
<dl>
<script>explorer.outline.writeEnabled = true;</script>
<dt><span class="decl"><li>typedef int <span class="currsymbol"><a href="http://www.dsource.org/projects/tango/browser/trunk/tango/util/container/RedBlack.d?rev=3791#L37">AttributeDummy</a></span>
<script>explorer.outline.addDecl('AttributeDummy');</script>; [private]</li></span></dt>
<script>explorer.outline.writeEnabled = false;</script>
<dd>
<font color="black">RedBlack implements basic capabilities of Red-Black trees,
        an efficient kind of balanced binary tree. The particular
        algorithms used are adaptations of those in Corman,
        Lieserson, and Rivest's <EM>Introduction to Algorithms</EM>.
        This class was inspired by &#40;and code cross-checked with&#41; a 
        similar class by Chuck McManis. The implementations of
        rebalancings during insertion and deletion are
        a little trickier than those versions since they
        don't swap Cell contents or use special dummy nilnodes. </font><br><br>
<font color="black">Doug Lea<br><br></font><br><br></dd></dl></td></tr>
                <tr><td id="docfooter">
                        Copyright (c) 2008 Kris Bell. All rights reserved :: page rendered by CandyDoc. Generated by <a href="http://code.google.com/p/dil">dil</a> on Sat Aug  2 16:08:33 2008.
                </td></tr>
        </table>
</div>
<script></script>
</body></html>